Revisiting R-Tree Construction Principles

Spatial indexing is a well researched field that benefited computer science with many outstanding results. Our effort in this paper can be seen as revisiting some outstanding contributions to spatial indexing, questioning some paradigms, and designing an access method with globally improved performance characteristics. In particular, we argue that dynamic R-tree construction is a typical clustering problem which can be addressed by incorporating existing clustering algorithms. As a working example, we adopt the well-known k-means algorithm. Further, we study the effect of relaxing the “two-way split procedure and propose a “multiway” split, which inherently is supported by clustering techniques. We compare our clustering approach to two prominent examples of spatial access methods, the Rand the R*-tree.